A characterization for 2-self-centered graphs
نویسندگان
چکیده
منابع مشابه
A characterization for 2-self-centered graphs
A Graph is called 2-self-centered if its diameter and radius both equal to 2. In this paper, we begin characterizing these graphs by characterizing edge-maximal 2-self-centered graphs via their compliments. Then we split characterizing edge-minimal 2-self-centered graphs into two cases. First, we characterize edge-minimal 2-self-centered graphs without triangles by introducing intersecting bi-i...
متن کاملSome Notes on Minimal Self–Centered Graphs
A graph is called self–centered if all of its vertices have the same eccentricity. We prove some new properties of such graphs and obtain all minimal self–centered graphs of up to 10 vertices.
متن کاملAlmost Self-centered Median and Chordal Graphs
Almost self-centered graphs were recently introduced as the graphs with exactly two non-central vertices. In this paper we characterize almost selfcentered graphs among median graphs and among chordal graphs. In the first case P4 and the graphs obtained from hypercubes by attaching to them a single leaf are the only such graphs. Among chordal graph the variety of almost self-centered graph is m...
متن کاملA CHARACTERIZATION FOR METRIC TWO-DIMENSIONAL GRAPHS AND THEIR ENUMERATION
The textit{metric dimension} of a connected graph $G$ is the minimum number of vertices in a subset $B$ of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $B$. In this case, $B$ is called a textit{metric basis} for $G$. The textit{basic distance} of a metric two dimensional graph $G$ is the distance between the elements of $B$. Givi...
متن کاملCharacterization of self-complementary graphs with 2-factors
Let G be a self-complementary graph (w.) and ir its degree sbquence. Th ;n G has a 2-factor if and only if R 2 is graphic. This is achieved by ohtaming a structure theorem regarding S.C. graphs without a Z-factor. Another irrreresting corollary of the structure theorem is that if G is a s c. graph of order p 3 N with minimum degree at least p/4, then G has a ?-factor and the result is the best ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2018
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.1994